Deciding reachability under persistent x86-TSO

We address the problem of verifying reachability in programs running under formal model Px86 defined recently by Raad et al. POPL'20 for persistent Intel x86 architecture. prove that this is decidable. To achieve that, we provide a new equivalent to and has feature being well structured system. Deriving result deep investigation properties interplay its components.